Optimization and failure detection of a wireless base station network

ABSTRACT

The present invention is directed to optimization and failure detection of a wireless base station network. Based on an RF link attenuation measurement, e.g., a Received Signal Strength Indication (RSSI) measurement, a server determines an optimal transmission sequence. For each base station of the optimal transmission sequence, a predecessor and a successor are designated. Each base station of the sequence generates a packet. The most distant base station (relative to the server) transmits its packet to its successor. Each base station of the sequence (in turn) receives the packet from its predecessor, combines the received packet with its own generated packet, transmits the combined packet to its successor, and so on until the combined packet is relayed to a super base station at the end of the sequence. The super base station transmits the packet to the server. Based on the packet size, the server can ascertain which base station (if any) failed.

CROSS-REFERENCES TO RELATED APPLICATIONS

This application is a continuation-in-part and claims benefit of U.S.Patent Application No. 16/778,718, filed Jan. 31, 2020, thespecification of which is incorporated herein in its entirety byreference.

FIELD OF THE INVENTION

The present invention generally relates to determining the optimaltransmission sequence (i.e., a subnetwork of base stations) in a largernetwork of base stations and detection of the failure of a base stationin that sequence.

BACKGROUND OF THE INVENTION

For energy-constrained networks of battery-powered devices, theenergy-efficiency of multi-hop routing is a critical design objective.Though the existing algorithms for a routing protocol are adequate fornetworks that operate under tight-but-typical, low-power energyconstraints, these algorithms are inadequate for applications where thenodes must communicate with a cloud server indirectly by relaying datathrough a transmission chain with a systemic energy budget that isunusually low.

For example, in typical methods known in the art, each node of thenetwork stores the complete routing information of the entire network.While this design makes the determination of the transmission route veryfast, every node of the entire network must update its routing table(and therefore consume energy) whenever the network topology changes.Other methods either require a single node to flood the entire networkwith route request messages or require several nodes to broadcastpackets just to determine the transmission route. Thus, a particularneed exists specifically for a multi-hop routing scheme with premiumenergy-efficiency.

SUMMARY OF THE INVENTION

The present invention is directed to the optimization and failuredetection of a wireless base station network. Each base station (of aplurality of base stations) may receive an RF link attenuationmeasurement, e.g., by performing a received signal strength indication(RSSI). The server may generate a matrix of base stations and super basestations that were detected by the RF link attenuation measurement,e.g., the RSSI. When initializing the network, each base station maytransmit a serial number to the server.

The server may determine (based on the RF link attenuation measurement,e.g., the RSSIs) an optimal transmission sequence of base stations froma most distant base station to a super base station. The networktopology of the optimal transmission sequence may be a linear daisychain. Since the server determines the optimal transmission sequence,base stations conserve the power that would otherwise be needed totransmit or broadcast packets to discover the route. The super basestation may wait for the command of the server to designate apredecessor and a successor for each base station of the optimaltransmission sequence. Contrary to methods known in the art, each basestation saves energy by being oblivious of the total optimaltransmission sequence (and even the total plurality of base stations)and only aware of the base station that precedes it and follows it inthe optimal transmission sequence.

Each base station of the optimal transmission sequence may generate apacket. The most distant base station of the optimal transmissionsequence may transmit its packet to the next base station. A basestation may transmit the packet without identifying the source in orderto conserve power. The next base station may receive the packet, maycombine the received packet with its own packet, and may transmit theaggregate packet to the next base station, and so on until the packetmay be received by the super base station. If a certain amount of timehas lapsed without receiving the aggregate packet, a base station maycarry on and transmit the packet that it generated without combining itwith the aggregate packet. Once a packet has been received by thetransmitting base station's successor, the packet may be cleared fromthe transmitting base station's memory.

The super base station may transmit the aggregate packet to the server.The server may determine how many base stations successfully transmittedbased on the size of the aggregate packet. The server may determinewhich base station in the optimal transmission sequence failed usingSequential Interruption Logic.

As used herein, the term “Sequential Interruption Logic” refers to thedetermination of which base station failed in a linear daisy chain ifeach base station may only transmit in sequential order. SequentialInterruption Logic reasons that a failed base station will prevent thetransmission of the aggregated packets of all the base stations thatprecede it in the optimal transmission sequence. Consequently, if theaggregate packet is missing multiple contributions from respective basestations, then the failed base station must be the sequentially latestbase station of the base stations from which contributions are missing.

Thus, to detect and resolve failure in a network where the base stationsdo not communicate directly with the server, the failure of a basestation is inferred from the size of the aggregate packet that isultimately received by the server. The server calculates how manycontributions are missing from the aggregate packet and determines whichbase station must have failed (since the base stations must transmit insequence). This inference obviates the need to communicate with the basestations to ascertain which base station 601 failed (a system designthat further minimizes energy consumption).

One of the many inventive technical features of the present invention isthe generation of an optimal transmission path in the form of a lineardaisy chain. Without wishing to limit the invention to any theory ormechanism, it is believed that the technical feature of the presentinvention advantageously provides for a decrease in overall energyconsumption in a wireless base station network due to the removal of theneed for base stations to store information on the entire network andthe fact that a base station only needs to communicate with twostations: a predecessor and a successor. None of the presently knownprior references or work has the unique inventive technical feature ofthe present invention.

Furthermore, the generation of an optimal transmission path in the formof a linear daisy chain is counterintuitive. The reason that it iscounterintuitive is because one skilled in the art would normally seek astraight line as the most efficient route. That is, a series of basestations installed in a straight line would communicate with the superbase station mounted in the same manner. One skilled in the art wouldexpect the straight-line topology to carry transmissions moreefficiently and that the construction of the optimal transmission pathin the server would be more time and energy efficient. Thus, the lineardaisy chain transmission path is counterintuitive. Surprisingly, thestraight-line transmission path encounters issues with data transmissionreliability, leading to excessive power consumption over repeatedattempts at data transmission and failure to transmit data in such a wayas to avoid retries. The linear-daisy chain transmission path rectifiesthis issue by finding the path with the most efficiency and reliability.Additionally, the straight-line transmission path is hindered by areaswhere radio signals cannot penetrate well or even penetrate at all,while the linear daisy chain transmission path allows for datatransmission around these areas without requiring human intervention asthe former method would.

Another inventive technical feature of the present invention is thestorage of one packet in memory of a base station, the deletion of thepacket from the memory only when the packet has been received by asuccessive base station, and the recursive transmission of packets untilthe memory of every base station is empty. Without wishing to limit theinvention to any theory or mechanism, it is believed that the technicalfeature of the present invention advantageously provides for a decreasein the energy consumption of each individual base station since only onepacket needs to be held in the base station memory at a time, and it isdeleted when it is no longer necessary. Furthermore, the recursivetransmission of packets until the memory of every base station is emptyis a time and energy efficient method of repeating transmissions untilthe packet is sent to the server correctly since it does not requirecommunication between a base station and anyone other than itspredecessor and successor. None of the presently known prior referencesor work has the unique inventive technical feature of the presentinvention.

Furthermore, the storage of one packet in memory of a base station, thedeletion of the packet from the memory only when the packet has beenreceived by a successive base station, and the recursive transmission ofpackets until the memory of each base station is empty are allcounterintuitive. The reason that it is counterintuitive is because oneskilled in the art would expect that the deletion of a packet aftertransmission in a system would consume more energy than simply storingpackets for a longer period of time in repeated transmission sequencessince the same packet would have to be generated repeatedly until allbase stations were functional. Thus, it would be counterintuitive tostore only one packet, delete it after transmission, and recursivelytransmit until the memory of every base station is cleared.Surprisingly, storing only one packet and deleting it from memory ismore energy efficient than storing data for a longer period of time,even in repeated transmission sequences.

Another inventive technical feature of the use of SequentialInterruption Logic in a server for failure detection. Without wishing tolimit the invention to any theory or mechanism, it is believed that thetechnical feature of the present invention advantageously provides for adecrease in overall energy consumption since the server does not need tocommunicate with any base stations in order to determine which basestation was unresponsive. None of the presently known prior referencesor work has the unique inventive technical feature of the presentinvention.

Furthermore, the use of Sequential Interruption Logic in a server forfailure detection is counterintuitive. The reason that it iscounterintuitive is because one skilled in the art would expect that theinternal logic required in the server for this method would reduce timeefficiency and potentially accuracy to the point of outweighing theenergy savings gained by removing communication between the server andbase stations. Thus, the use of Sequential Interruption Logic forfailure detection is counterintuitive. Surprisingly, SequentialInterruption Logic is comparable in time efficiency and accuracy toprior methods of failure detection while decreasing energy consumption.

BRIEF DESCRIPTION OF THE DRAWINGS

The features and advantages of the present invention will becomeapparent from a consideration of the following detailed descriptionpresented in connection with the accompanying drawings in which:

FIG. 1 is a flow chart of the method of claim 1 for optimization andfailure detection of an exemplary wireless base station network, such as(by way of non-limiting example) a Bluetooth Low Energy indoorlocalization system. The wireless base station network may comprise acloud server, at least one super base station and a plurality of basestations associated with the respective super base station. Each superbase station may comprise, for example, an ultra-wideband antenna forset-up & maintenance and a low-power, wide-area network (LPWAN, e.g.,LoRa) antenna for data. Each base station may comprise, for example, anultra-wideband antenna for set-up & maintenance and an LPWAN (e.g.,LoRa) antenna for data. Each base station may comprise memory fortemporary storage of packets.

FIG. 2 is a flow chart of a method for optimization and failuredetection of a wireless base station network in which supportive stepshave been added to elaborate upon peripheral features of the presentinvention.

FIG. 3 is a flow chart of the method of claim 7 for failure detection ofan optimal transmission sequence of base stations. Particular emphasisis placed upon the failure detection to underscore the energy-efficiencyof the cloud server inferring the failure of a base station throughSequential Interruption Logic rather than by querying the base station(which would require the base station to waste power by transmitting aresponse).

FIG. 4 is a diagram showing an exemplary response protocol for ahypothetical failure of a base station.

FIG. 5 is a diagram of an exemplary implementation of a tri-bandantenna. The antenna may be, for example, a monopole or multipole or anantenna array of a plurality of monopoles and/or multipoles. The antennamay be configured with a wide bandwidth. The signal received by theantenna may be processed by, for example, a Bluetooth filter, an LPWAN(e.g., LoRa) filter, and an ultra-wideband filter such that the filterseffectively configure a single, wideband antenna to function as atri-band antenna.

FIG. 6 is a diagram of the system of claim 11 for optimization andfailure detection of a network of base stations. The components of acloud server are shown, comprising a processor, an antenna, arandomly-accessed memory (RAM) component, and a memory component. Thecomponents of a base station are shown, comprising a processor, anantenna, a RAM component, and a memory component. The components of theantenna in the base station are shown, comprising an ultra-widebandantenna and an LPWAN antenna. The components of a super base station areshown, comprising a processor, an antenna, a RAM component, and a memorycomponent. The components of the antenna in the super base station areshown, comprising an ultra-wideband antenna and an LPWAN antenna.Multiple base station nodes are shown to express the plurality of basestations in an optimal transmission sequence.

FIG. 7 is a diagram of the system of claim 17 for failure detection of awireless base station in an optimal transmission sequence. Thecomponents of a cloud server are shown, comprising a processor, anantenna, a RAM component, and a memory component. The component of abase station are shown, comprising a processor, an antenna, a RAMcomponent, and a memory component. The components of the antenna of thebase station are shown, comprising an ultra- wideband antenna and anLPWAN antenna. The components of a super base station are shown,comprising an antenna. The components of the antenna in the super basestation are shown, comprising an ultra-wideband antenna and an LPWANantenna. Multiple base station nodes are shown to express the pluralityof base stations in an optimal transmission sequence.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

When used herein, terms describing order and position (such as, but notlimited to, “predecessor,” “successor,” “next”, “prior” and “previous”)are not limiting upon the claims unless expressly recited therein. Itwill be appreciated that the terms “predecessor” and “successor” areused to mean the preceding (or previous) base station 601 and thesucceeding (or next) base station 601, respectively. However, when theseterms are used herein to identify a base station 601, these termsidentify a base station 601 that is relative to the most recentiteration of a recursive loop. Thus, each iteration of the recursioncauses a reassessment or relabeling of the described elements. Forexample, if one iteration of the loop defines a “base station 601” and“its successor,” then in the next iteration of the loop, the basestation 601 is actually the successor from the previous iteration andthe meaning of “its successor” (in the second iteration) actually refersto the successor of the successor of the base station 601 from the firstiteration. Thus, when identifying a base station 601, these relativeadjectives relate back through each of the previous loop iterations allthe way to the very first iteration. Consequently, the claim elementidentified by the terms “base station 601,” “predecessor,” and“successor” depends on the iteration of the loop. Restated, the terms“predecessor” and “successor” only relatively label the claim elements,and the claim element objectively identified by the label must beascertained through compound application of the recursion.

The figures presented in this patent application (including the angles,proportions of dimensions, etc.) are representative only and the claimsare not limited by the dimensions of the figures.

Referring to FIG. 1, the present invention features a method 100 foroptimization and failure detection of a wireless base station 601network. In some embodiments, the method comprises each base station 601of zero, one or a plurality of base stations measuring 101 a RF linkattenuation measurement. In some embodiments, the RF link attenuationmeasurement is a received signal strength indicator (RSSI). If thenetwork is being initialized (such as, for example, upon deployment forthe first time), each base station 601 of the zero, one or plurality ofbase stations may transmit a serial number to the server 603. Based onthe RF link attenuation measurements, the server 603 may determine 102an optimal transmission sequence of base stations from a most distantbase station 601 to a super base station 602 in the form of a lineardaisy chain. The super base station 602 may designate 103 a predecessorand a successor for each base station 601 in the optimal transmissionsequence.

In some embodiments, each base station 601 of the optimal transmissionsequence may generate 104 a packet. The most distant base station 601 ofthe optimal transmission sequence may transmit 105 its generated packetto its successor, the successor may transmit 106 to its respectivesuccessor a combined packet comprising its own generated packet and thepacket received from its predecessor, and so on, until the super basestation 602 receives 107 the combined packet. In other embodiments, oncea time to receive a packet from its predecessor has lapsed, a basestation 601 may transmit 106 its generated packet to its successor.Following this, the successor may transmit 106 to its respectivesuccessor a combined packet comprising its own generated packet and thepacket received from its predecessor, and so on, until the super basestation 602 receives 107 the combined packet. In some embodiments, abase station 601 may transmit the packet without identifying thetransmission source in order to conserve power.

In some embodiments, the server 603 may receive 108 the combined packettransmitted by the super base station 602. The server 603 may identify109 any nonfunctional super base station 602 and/or any nonfunctionalbase stations in the optimal transmission sequence using SequentialInterruption Logic based on a payload size of the packet. In someembodiments, the server 603 may optimize the network repeatedly 110until all packets have been received.

In some embodiments, the antenna 721 of the super base station 602 maycomprise an ultra-wideband antenna 722 for set-up & maintenance and anlow-power wide-area network (LPWAN) antenna 723 for data. In someembodiments, the antenna 711 of the base station 601 may comprise anultra-wideband antenna 712 for set-up & maintenance and an LPWAN antenna713 for data. The server 603 may be a local server or a cloud server.

Referring now to FIG. 2, the present invention features a method 200 foroptimization and failure detection of a wireless base station 601network. In some embodiments, the wireless base station 601 network maycomprise a server 603, a plurality of super base stations, and aplurality of base stations. Each super base station 602 of the pluralityof super base stations may comprise a first processor 1007 capable ofexecuting computer-executable instructions, a first randomly accessedmemory (RAM) device 1008, a first memory device 1009, and a firstantenna 721. Each base station 601 of the zero, one or plurality of basestations may comprise a second processor 1004 capable of executingcomputer-executable instructions, a second RAM device 1005, a secondmemory device 1006, and a second antenna 711. In some embodiments, themethod may comprise each base station 601 of the zero, one or pluralityof base stations performing 201 a RF link attenuation measurement ofeach base station 601 of the zero, one or plurality of base stations.The server 603 may generate 202 a matrix comprising base stations andsuper base stations detected by the RF link attenuation measurement. Insome embodiments, if this optimization is also an initialization, eachbase station 601 of the zero, one or plurality of base stations maytransmit 203 a serial number to the server 603. In some embodiments, theRF link attenuation measurement is a received signal strength indicator(RSSI).

In some embodiments, the server 603 may determine 204 an optimaltransmission sequence based on RF link attenuation measurement data ofbase stations to the respective super base station 602 of the pluralityof super base stations in the form of a linear daisy chain. The server603 may command 205 the respective super base station 602 to designate apredecessor in the optimal transmission sequence and a successor in theoptimal transmission sequence for each base station 601 in the optimaltransmission sequence. The super base station 602 may designate 206 thepredecessor in the optimal transmission sequence and the successor inthe optimal transmission sequence for each base station 601 in theoptimal transmission sequence. The predecessor in the optimaltransmission sequence of a first base station 601 in the optimaltransmission sequence may be null, and the successor in the optimaltransmission sequence of a last base station 601 in the optimaltransmission sequence may be the super base station 602.

In some embodiments, the first base station 601 of the optimaltransmission sequence may generate 207 a packet at a scheduled time. Ifthe first base station 601 of the optimal transmission sequencegenerated the packet, the first base station 601 of the optimaltransmission sequence may store 208 the packet in memory. When thepacket from the predecessor in the optimal transmission sequence hasbeen received or a time to receive the packet from the predecessor inthe optimal transmission sequence has lapsed, the base station 601 maytransmit 209 the stored packet to the successor in the optimaltransmission sequence. In some embodiments, the base may transmit apacket without identifying the transmission source of the packet inorder to conserve power. The successor in the optimal transmissionsequence may receive 210 the transmitted packet and the base station 601may clear 211 the transmitted packet from memory when the transmittedpacket is received by the successor in the optimal transmissionsequence. The successor in the optimal transmission sequence maygenerate 212 the packet. In some embodiments, the successor in theoptimal transmission sequence may combine 213 the received packet andthe generated packet. The successor in the optimal transmission sequencemay store 214 the combined packet in memory. In turn, each base station601 of the optimal transmission sequence may receive a packet from itspredecessor, combine the packet with its own packet, and transmit thecombined packet to its successor until 215 the super base station 602stores the combined packet in memory.

In some embodiments, the super base station 602 may transmit 216 thestored packet to the server 603. The server 603 may receive 217 thepacket. The server 603 may determine 218 a number of functional basestations in the optimal transmission sequence using a payload size ofthe packet. The server 603 may identify 219 zero or one nonfunctionalsuper base station 602 and zero or more nonfunctional base stations inthe optimal transmission sequence using Sequential Interruption Logicbased on the number of functional base stations in the optimaltransmission sequence. If the super base station 602 or one or more basestations in the optimal transmission sequence failed, the server 603 maytransmit 220 a maintenance request to Tech Support and the network ofbase stations may be optimized repeatedly 221 until the memory of eachbase station 601 of the zero, one or plurality of base stations and thememory of the super base station 602 are empty of packets.

In some embodiments, the antenna 721 of the super base station 602 maycomprise an ultra-wideband antenna 722 for set-up & maintenance and anLPWAN antenna 723 for data. In some embodiments, the antenna 711 of thebase station 601 may comprise an ultra-wideband antenna 712 for set-up &maintenance and an LPWAN antenna 713 for data. The server 603 may be alocal server or a cloud server.

Referring now to FIG. 3, the present invention features a method 300 forfailure detection of a wireless base station 601 in an optimaltransmission sequence. In some embodiments, a network topography of theoptimal transmission sequence may be a linear daisy chain. A successorof a last base station 601 in the optimal transmission sequence may be aserver 603. The method may comprise each base station 601 of the optimaltransmission sequence generating 301 a packet. The most distant basestation 601 of the optimal transmission sequence may transmit 302 thepacket to its successor in the optimal transmission sequence, and thesuccessor may combine 303 the received packet with its own generatedpacket. The successor may transmit 304 the combined packet to its ownsuccessor in the optimal transmission sequence if the packet from apredecessor in the optimal transmission sequence has been received orwhen a time to receive the packet from the predecessor has lapsed. Inturn, a successor in the optimal transmission sequence may receive thecombined packet from its predecessor, combine the received packet withits own generated packet, and transmit the combined packet to its ownsuccessor until the server 603 receives the combined packet.

In some embodiments, the server 603 may determine 306 a number offunctional base stations in the optimal transmission sequence using apayload size of the combined packet. The server 603 may identify 307zero or more nonfunctional base stations in the optimal transmissionsequence using Sequential Interruption Logic based on the number offunctional base stations in the optimal transmission sequence.

In some embodiments, the antenna 721 of the super base station 602 maycomprise an ultra-wideband antenna 722 for set-up & maintenance and anLPWAN antenna 723 for data. In some embodiments, the antenna 711 of thebase station 601 may comprise an ultra-wideband antenna 712 for set-up &maintenance and an LPWAN antenna 713 for data.

A server 603 may comprise at least one of network computing environmentsknown in the art with computer system configurations further comprisingpersonal computers, desktop computers, laptop computers, rack computers,mainframes and the like. The network computing environment may compriseat least a process for executing instructions, RAM, memory upon which isstored instructions executable by the processor. The server 603 may alsobe implemented in distributed system environments where operations aredelegated to and/or shared between local and remote computer systemsacross a network. In a distributed system environment, program modulesmay be located in both local and remote memory storage devices. Theserver 603 may be a local server or a cloud server.

A base station 601 may be (by way of non-limiting example) any wirelessdevice, comprising a processor 1004 for executing instructions, RAM1005, memory 1006 upon which is stored instructions executable by theprocessor, and an antenna 711. A super base station 602 may be (by wayof non-limiting example) any wireless device, comprising a processor1007 for executing instructions, RAM 1008, memory 1009 upon which isstored instructions executable by the processor, and an antenna 721.Those skilled in the art will appreciate that a wireless device mayinclude personal computers, desktop computers, laptop computers, messageprocessors, hand-held devices, multi-processor systems,microprocessor-based or programmable consumer electronics, network PCs,minicomputers, mainframe computers, mobile telephones, PDAs, pagers,routers, access points, transceivers, and the like.

An antenna 701 may be a wideband antenna configured with a bandwidthgreater than 0 GHz and less than or equal to 7 GHz. The wideband antenna701 may be configured with filters to distinguish multiple bands ofradiofrequencies. The bands of radiofrequencies may include non-limitingexamples such as ultra-wideband (UWB) 702, an LPWAN (such as LoRa) 703,and Bluetooth 704. Ultra-wideband 702 may comprise frequencies exceedingthe lesser of 500 MHz or 20% of the arithmetic center frequency. TheLPWAN 703 may comprise 433 MHz, 868 MHz, and 915 MHz frequencies.Bluetooth 704 may comprise frequencies ranging from 2.400 GHz-2.4835 GHz(including guard bands).

Instructions that cause at least one processing circuit to perform oneor more operations are “computer-executable.” Within the scope of thepresent invention, “computer-readable memory,” “computer-readablestorage media,” and the like comprises two distinctly different kinds ofcomputer-readable media: physical storage media that storescomputer-executable instructions and transmission media that carriescomputer-executable instructions. Physical storage media includes RAMand other volatile types of memory; ROM, EEPROM and other non-volatiletypes of memory; CD-ROM, CD-RW, DVD-ROM, DVD-RW and other optical diskstorage; magnetic disk storage or other magnetic storage devices; andany other tangible medium that can store computer-executableinstructions that can be accessed and processed by at least oneprocessing circuit. Transmission media can include signals carryingcomputer-executable instructions over a network to be received by ageneral-purpose or special-purpose computer. Thus, it is emphasized that(by disclosure or recitation of the exemplary term “non-transitory”)embodiments of the present invention expressly exclude signals carryingcomputer-executable instructions.

However, it should be understood that once a signal carryingcomputer-executable instructions is received by a computer, the type ofcomputer-readable storage media transforms automatically fromtransmission media to physical storage media. This transformation mayeven occur early on in intermediate memory such as (by way of exampleand not limitation) a buffer in the RAM of a network interface card,regardless of whether the buffer's content is later transferred to lessvolatile RAM in the computer. Thus, devices that merely repeat a signalare contemplated by the embodiments of the present invention, eventhough the media that carry the signal between such devices and thesignal itself are expressly not included within the claim scope. Thus,it should be understood that “non-transitory computer-readable storagemedia” may be used herein instead of simply “physical storage media” or“physical computer-readable storage media” in order to underscore thateven transmission media necessarily involves eventual transformationinto physical storage media and to therefore capture all embodimentswhere the computer-readable instructions are stored in physical storagemedia·even if only temporarily before transforming back intotransmission media.

In some embodiments, when executed by the processor of the server 603,the instructions may cause the processor to perform operations. Theoperations may comprise determining based on a plurality of RF linkattenuation measurements an optimal transmission sequence of basestations from a most distant base station 601 to a super base station602, wherein a network topology of the optimal transmission sequence isa linear daisy chain; receiving the combined packet transmitted by thesuper base station 602; identifying any nonfunctional super base station602 and any nonfunctional base stations 601 in the optimal transmissionsequence using Sequential Interruption Logic based on a payload size ofthe packet; and receiving a packet. In some embodiments, the RF linkattenuation measurement may be an RSSI.

In other embodiments, when executed by the processor of the server 603,the instructions may cause the processor to perform operations. Theoperations may comprise receiving the combined packet; determining anumber of functional base stations in the optimal transmission sequenceusing a payload size of the combined packet; and identifying zero ormore nonfunctional base stations in the optimal transmission sequenceusing Sequential Interruption Logic based on the number of functionalbase stations in the optimal transmission sequence.

In some embodiments, when executed by the processor of a base station601, the instructions may cause the processor to perform operations. Theoperations may comprise measuring the RF link attenuation measurement;generating a packet; transmitting its generated packet to its successor;and transmitting, if a packet from its predecessor has been received orwhen a time to receive the packet from its predecessor has lapsed, acombined packet comprising its own generated packet and the packetreceived from its predecessor.

In other embodiments, when executed by the processor of a base station601, the instructions may cause the processor to perform operations. Theoperations may comprise generating a packet; transmitting the packet toits successor in the optimal transmission sequence; combining thereceived packet with its own generated packet; and transmitting thecombined packet to its own successor in the optimal transmissionsequence if the packet from a predecessor in the optimal transmissionsequence has been received or when a time to receive the packet from thepredecessor has lapsed.

In some embodiments, when executed by the processor of a super basestation 601, the instructions may cause the processor to performoperations. The operations may comprise designating a predecessor and asuccessor for each base station 601 in the optimal transmissionsequence; receiving the combined packet; and transmitting the combinedpacket to the server 603.

Referring to FIG. 6, the present invention features a system foroptimization and failure detection of a network of base stations. Insome embodiments, the system may comprise a server 603 that has a firstprocessor 1001 capable of executing computer-executable instructions, afirst antenna 701, a first RAM component 1002, and a first memorycomponent 1003. The memory may comprise instructions for determining 102based on a plurality of RF link attenuation measurements an optimaltransmission sequence of base stations from a most distant base station601 to a super base station 602. A network topology of the optimaltransmission sequence may be a linear daisy chain. Other instructionsinclude receiving 108 the combined packet transmitted by the super basestation 602, identifying 109 any nonfunctional super base station 602and any nonfunctional base stations in the optimal transmission sequenceusing Sequential Interruption Logic based on a payload size of thepacket, and receiving 110 a packet. In some embodiments, the RF linkattenuation measurement may be an RSSI.

In some embodiments, the system also may comprise a plurality of basestations. Each base station 601 of the zero, one or plurality of basestations may have a second processor 1004 capable of executingcomputer-executable instructions, a second antenna 711, a second RAMcomponent 1005, and a second memory component 1006. The memory maycomprise instructions for measuring 101 a RF link attenuationmeasurement, generating 104 a packet, transmitting 105 its generatedpacket to its successor, and transmitting 106, if a packet from itspredecessor has been received or when a time to receive the packet fromits predecessor has lapsed, a combined packet comprising its owngenerated packet and the packet received from its predecessor. It mayalso comprise instructions to repeat 107 packet combination andtransmission to the successor recursively until the super base station602 receives the combined packet. Each base station 601 in the zero, oneor plurality of base stations may transmit a serial number to the server603 only when initializing. In some embodiments, the RF link attenuationmeasurement may be an RSSI.

In some embodiments, the system may also comprise a plurality of superbase stations. Each super base station 602 of the plurality of superbase stations may comprise a third processor 1007 capable of executingcomputer-executable instructions, a third antenna 721, a third RAMcomponent 1008, and a third memory component 1009. The memory maycomprise instructions for designating 103 a predecessor and a successorfor each base station 601 in the optimal transmission sequence,receiving 107 the combined packet, and transmitting 108 the combinedpacket to the server (603).

In some embodiments, a network topography of the optimal transmissionsequence generated by the server 603 may be a linear daisy chain and atransmission source of the packet may be unidentified in order toconserve power.

In some embodiments, the antenna 721 of a super base station 602 in theplurality of super base stations may further comprise an ultra-widebandantenna 722 for set-up & maintenance and an LPWAN antenna 723 for data.The antenna 711 of a base station 601 in the plurality of base stationsmay further comprise an ultra-wideband antenna 712 for set-up &maintenance and an LPWAN antenna 713 for data. The server 603 may be alocal server or a cloud server.

Referring to FIG. 7, the present invention features a system for failuredetection of a wireless base station 601 in an optimal transmissionsequence, wherein a successor of a last base station 601 in the optimaltransmission sequence is a server 603. In some embodiments, the systemmay comprise a server 603. The server 603 may comprise a first processor1001 capable of executing computer-executable instructions, a firstantenna 701, a first RAM component 1002, and a first memory component1003. The memory 1003 may comprise instructions for receiving 305 thecombined packet, determining 306 a number of functional base stations inthe optimal transmission sequence using a payload size of the combinedpacket, and identifying 307 zero or more nonfunctional base stations inthe optimal transmission sequence using Sequential Interruption Logicbased on the number of functional base stations in the optimaltransmission sequence.

In some embodiments, the system may also comprise a plurality of basestations. Each base station 601 of the zero, one or plurality of basestations may comprise a second processor 1004 capable of executingcomputer-executable instructions, a second antenna 711, a second RAMcomponent 1005, and a second memory component 1006. The memory 1006 maycomprise instructions for generating 301 a packet, transmitting 302 thepacket to its successor in the optimal transmission sequence, combining303 the received packet with its own generated packet, and transmitting304 the combined packet to its own successor in the optimal transmissionsequence if the packet from a predecessor in the optimal transmissionsequence has been received or when a time to receive the packet from thepredecessor has lapsed. The instructions may also comprise therepetition 305 of packet combination and transmission to the successorrecursively until the server 603 receives the combined packet. In someembodiments, the system may also comprise a plurality of super basestations, wherein each super base station 602 of the plurality of superbase stations may comprise a third antenna 721.

In some embodiments, a network topography of the optimal transmissionsequence generated by the server 603 is a linear daisy chain. Theantenna 721 of a super base station 602 in the plurality of super basestations may comprise an ultra-wideband antenna 722 for set-up &maintenance and an LPWAN antenna 723 for data. The antenna 711 of a basestation 601 in the plurality of base stations may further comprise anultra-wideband antenna 712 for set-up & maintenance and an LPWAN antenna713 for data. The server 603 may be a local server or a cloud server.

The preceding description sets forth numerous specific details (e.g.,specific configurations, parameters, examples, etc.) of the disclosedembodiments, examples of which are illustrated in the accompanyingdrawings. It should be recognized, however, that such description is notintended as a limitation on the scope of the disclosed embodiments, butis intended to elaborate upon the description of these embodiments. Itwill be evident to a person of ordinary skill in the art that thepresent invention can be practiced without every specific detaildescribed infra. Moreover, well-known methods, procedures, components,and circuits have not been described in detail so as not tounnecessarily obscure aspects of the embodiments of the presentinvention.

It is fully contemplated that the features, components, and/or stepsdescribed with respect to one embodiment may be combined with thefeatures, components, and/or steps described with respect to otherembodiments of the present disclosure. To avoid needless descriptiverepetition, one or more components or actions described in accordancewith one exemplary embodiment can be used or omitted as applicable fromother embodiments. For the sake of brevity, the numerous iterations ofthese combinations were not described separately. The same referencenumbers may have been used to refer to the same or similar elements indifferent drawings. Alternately, different reference numbers may be usedto refer to the same or similar elements in the drawings of differentembodiments. Any distinction of an element's reference number in oneembodiment from another is not limiting in any way, does not suggestthat elements of one embodiment could not be combined with orsubstituted for elements in another embodiment, and (most importantly)is specifically intended only to facilitate the matching of elements inthe disclosure to their corresponding claim recitations.

What is claimed is:
 1. A method (100) for optimization of a network ofbase stations, the method comprising: A. measuring (101), by each basestation (601) of zero, one or a plurality of base stations, an RF linkattenuation measurement; B. determining (102), by a server (603), basedon the RF link attenuation measurement, an optimal transmission sequenceof base stations from a most distant base station (601) to a super basestation (602); C. designating (103), by the super base station (602), apredecessor and a successor for each base station (601) in thetransmission sequence; D. generating (104), by each base station (601)of the transmission sequence, a packet; E. transmitting (105), by themost distant base station (601) of the transmission sequence, itsgenerated packet to its successor; F. transmitting (106), by thesuccessor, if a packet from its predecessor has been received, acombined packet comprising its own generated packet and the packetreceived from its predecessor; G. repeating (107) step F recursivelyuntil the super base station (602) receives the combined packet; H.receiving (108), by the server (603), the combined packet transmitted bythe super base station (602); I. identifying (109), by the server (603),any nonfunctional super base station (602) or any nonfunctional basestations in the transmission sequence; and J. repeating (110) steps A-Iuntil all packets have been received by the server (603).
 2. The methodof claim 1, wherein a network topography of the transmission sequence isa linear daisy chain.
 3. The method of claim 2, wherein a transmissionsource of the packet is unidentified in order to conserve power.
 4. Themethod of claim 3, wherein an antenna (721) of the super base station(602) comprises an ultra-wideband antenna (722) for set-up & maintenanceand a low-power, wide-area network (LPWAN) antenna (723) for data. 5.The method of claim 4, wherein the antenna (711) of the base station(601) further comprises an ultra-wideband antenna (712) for set-up &maintenance and an LPWAN antenna (713) for data.
 6. The method of claim5 further comprising transmitting, by each base station (601) of theplurality of base stations, a serial number to the server (603) onlywhen initializing.
 7. The method of claim 1 further comprisingtransmitting (106), by the successor, when a time to receive the packetfrom its predecessor has lapsed, a combined packet comprising its owngenerated packet and the packet received from its predecessor.
 8. Themethod of claim 1, wherein the server (603) is a cloud server or a localserver.
 9. The method of claim 1, wherein identifying (109), by theserver (603), any nonfunctional super base station (602) or anynonfunctional base stations in the transmission sequence uses SequentialInterruption Logic based on a payload size of the packet.
 10. The methodof claim 1, wherein the RF link attenuation measurement is a receivedsignal strength indicator (RSSI).
 11. A method (300) for failuredetection of a wireless base station (601) in an optimal transmissionsequence, wherein a successor of a last base station (601) in thetransmission sequence is a server (603), the method comprising: A.generating (301), by each base station (601) of the transmissionsequence, a packet; B. transmitting (302), by the most distant basestation (601), the packet to its successor in the transmission sequence;C. combining (303), by the successor, the received packet with its owngenerated packet; D. transmitting (304), by the successor, the combinedpacket to its own successor in the transmission sequence if the packetfrom a predecessor in the transmission sequence has been received; E.repeating (305) steps C-D recursively until the server (603) receivesthe combined packet; F. identifying (307), by the server (603), zero ormore nonfunctional base stations in the transmission sequence.
 12. Themethod of claim 11, wherein a network topography of the transmissionsequence is a linear daisy chain.
 13. The method of claim 12, wherein anantenna (721) of the super base station (602) comprises anultra-wideband antenna (722) for set-up & maintenance and an LPWANantenna (723) for data.
 14. The method of claim 13, wherein the antenna(711) of the base station (601) further comprises an ultra-widebandantenna (712) for set-up & maintenance and an LPWAN antenna (713) fordata.
 15. The method of claim 11 further comprising transmitting (106),by the successor, when a time to receive the packet from its predecessorhas lapsed, a combined packet comprising its own generated packet andthe packet received from its predecessor.
 16. The method of claim 11,wherein the server (603) is a cloud server or a local server.
 17. Themethod of claim 11 further comprising determining (306), by the server(603), a number of functional base stations in the optimal transmissionsequence.
 18. The method of claim 17, wherein identifying (109), by theserver (603), zero or more nonfunctional base stations in the optimaltransmission sequence uses Sequential Interruption Logic based on apayload size of the packet or a number of function base stations in theoptimal transmission sequence.
 19. A system for optimization of anetwork of base stations, the system comprising: A. a server (603),comprising: i. a first processor (1001) capable of executingcomputer-executable instructions, ii. a first antenna (701), iii. afirst randomly-accessed memory RAM component (1002), and iv. a firstmemory component (1003), wherein the memory comprises instructions for:a. determining (102) based on an RF link attenuation measurement anoptimal transmission sequence of base stations from a most distant basestation (601) to a super base station (602), b. receiving (108) thecombined packet transmitted by the super base station (602), c.identifying (109) any nonfunctional super base station (602) or anynonfunctional base stations in the transmission sequence, and d.receiving (110) a packet; B. a plurality of base stations, wherein eachbase station (601) of the plurality of base stations comprises: i. asecond processor (1004) capable of executing computer-executableinstructions, ii. a second antenna (711), iii. a second RAM component(1005), and iv. a second memory component (1006), wherein the memorycomprises instructions for: a. measuring (101) the RF link attenuationmeasurement, b. generating (104) a packet, c. transmitting (105) itsgenerated packet to its successor, and d. transmitting (106), if apacket from its predecessor has been received, a combined packetcomprising its own generated packet and the packet received from itspredecessor, e. repeating (107) step d recursively until the super basestation (602) receives the combined packet; and C. a plurality of superbase stations, wherein each super base station (602) of the plurality ofsuper base stations comprises: i. a third processor (1007) capable ofexecuting computer-executable instructions, ii. a third antenna (721),iii. a third RAM component (1008), and iv. a third memory component(1009), wherein the memory comprises instructions for: a. designating(103) a predecessor and a successor for each base station (601) in thetransmission sequence, b. receiving (107) the combined packet, and c.transmitting (108) the combined packet to the server (603).
 20. Thesystem of claim 19, wherein a network topography of the transmissionsequence is a linear daisy chain.
 21. The system of claim 20, wherein atransmission source of the packet is unidentified in order to conservepower.
 22. The system of claim 21, wherein the antenna (721) of thesuper base station (602) comprises an ultra-wideband antenna (722) forset-up & maintenance and an LPWAN antenna (723) for data.
 23. The systemof claim 22, wherein the antenna (711) of the base station (601) furthercomprises an ultra-wideband antenna (712) for set-up & maintenance andan LPWAN antenna (713) for data.
 24. The system of claim 23 furthercomprising transmitting, by each base station (601) of the plurality ofbase stations, a serial number to the server (603) only wheninitializing.
 25. The system of claim 19, wherein the second memorycomponent (1006) further comprises instructions for transmitting (106),by the successor, when a time to receive the packet from its predecessorhas lapsed, a combined packet comprising its own generated packet andthe packet received from its predecessor.
 26. The system of claim 19,wherein the server (603) is a cloud server or a local server.
 27. Thesystem of claim 19, wherein identifying (109), by the server (603), anynonfunctional super base station (602) or any nonfunctional basestations in the transmission sequence uses Sequential Interruption Logicbased on a payload size of the packet.
 28. The system of claim 19,wherein the RF link attenuation measurement is a received signalstrength indicator (RSSI).
 29. A system for failure detection of awireless base station (601) in an optimal transmission sequence, whereina successor of a last base station (601) in the transmission sequence isa server (603), the system comprising: A. the server (603), comprising:i. a first processor (1001) capable of executing computer-executableinstructions, ii. a first antenna (701), iii. a first RAM component(1002), and iv. a first memory component (1003), wherein the firstmemory comprises instructions for: a. receiving (305) the combinedpacket, b. determining (306) a number of functional base stations in thetransmission sequence, and c. identifying (307) zero or morenonfunctional base stations in the transmission sequence; and B. aplurality of base stations, wherein each base station (601) of aplurality of base stations comprises: i. a second processor (1004)capable of executing computer-executable instructions, ii. a secondantenna (711), iii. a second RAM component (1005), and iv. a secondmemory component (1006), wherein the second memory comprisesinstructions for: a. generating (301) a packet, b. transmitting (302)the packet to its successor in the transmission sequence, c. combining(303) the received packet with its own generated packet, d. transmitting(304) the combined packet to its own successor in the transmissionsequence if the packet from a predecessor in the transmission sequencehas been received, and e. repeating (305) steps c-d recursively untilthe server (603) receives the combined packet.
 30. The system of claim29, wherein a network topography of the transmission sequence is alinear daisy chain.
 31. The system of claim 30, wherein the antenna(721) of the super base station (602) further comprises anultra-wideband antenna (722) for set-up & maintenance and an LPWANantenna (723) for data.
 32. The system of claim 31, wherein the antenna(711) of the base station (601) further comprises an ultra-widebandantenna (712) for set-up & maintenance and an LPWAN antenna (713) fordata.
 33. The system of claim 29, wherein the first memory component(1003) further comprises instructions for determining (306) a number offunctional base stations in the transmission sequence using a payloadsize of the combined packet.
 34. The system of claim 29, whereinidentifying (109), by the server (603), any nonfunctional super basestation (602) or any nonfunctional base stations in the transmissionsequence uses Sequential Interruption Logic based on a payload size ofthe packet.
 35. The system of claim 29, wherein the second memorycomponent (1006) further comprises instructions for transmitting (106),by the successor, when a time to receive the packet from its predecessorhas lapsed, a combined packet comprising its own generated packet andthe packet received from its predecessor.
 36. The system of claim 29,wherein the server (603) is a cloud server or a local server.